Upconversion of optical signals with multi-longitudinal-mode pump lasers

Multi-longitudinal-mode lasers have been believed to be good candidates as pump sources for optical frequency conversion. However, we present a semi-classical model for frequency conversion of optical signals with a multimode pump laser, which shows that fluctuations of the instantaneous pump power limit the conversion efficiency. In an experiment, we upconverted a 1550 nm optical signal in a periodically poled lithium niobate waveguide using with a multi-longitudinal-mode laser, an observed a maximum conversion efficiency of 70%, in good agreement with our theoretical model. Compared to single-mode pumping, multimode pumping is not a suitable technique for attaining stable near-unity-efficiency frequency conversion. However, the results obtained here could find application in characterization of the spectral or temporal structure of multi-longitudinal-mode lasers.Comment: 6 pages, 4 figures, comments are welcome

Almost Universal Anonymous Rendezvous in the Plane

Two mobile agents represented by points freely moving in the plane and starting at two distinct positions, have to meet. The meeting, called rendezvous, occurs when agents are at distance at most $r$ of each other and never move after this time, where $r$ is a positive real unknown to them, called the visibility radius. Agents are anonymous and execute the same deterministic algorithm. Each agent has a set of private attributes, some or all of which can differ between agents. These attributes are: the initial position of the agent, its system of coordinates (orientation and chirality), the rate of its clock, its speed when it moves, and the time of its wake-up. If all attributes (except the initial positions) are identical and agents start at distance larger than $r$ then they can never meet. However, differences between attributes make it sometimes possible to break the symmetry and accomplish rendezvous. Such instances of the rendezvous problem (formalized as lists of attributes), are called feasible. Our contribution is three-fold. We first give an exact characterization of feasible instances. Thus it is natural to ask whether there exists a single algorithm that guarantees rendezvous for all these instances. We give a strong negative answer to this question: we show two sets $S_1$ and $S_2$ of feasible instances such that none of them admits a single rendezvous algorithm valid for all instances of the set. On the other hand, we construct a single algorithm that guarantees rendezvous for all feasible instances outside of sets $S_1$ and $S_2$. We observe that these exception sets $S_1$ and $S_2$ are geometrically very small, compared to the set of all feasible instances: they are included in low-dimension subspaces of the latter. Thus, our rendezvous algorithm handling all feasible instances other than these small sets of exceptions can be justly called almost universal

Deterministic meeting of sniffing agents in the plane

Two mobile agents, starting at arbitrary, possibly different times from arbitrary locations in the plane, have to meet. Agents are modeled as discs of diameter 1, and meeting occurs when these discs touch. Agents have different labels which are integers from the set of 0 to L-1. Each agent knows L and knows its own label, but not the label of the other agent. Agents are equipped with compasses and have synchronized clocks. They make a series of moves. Each move specifies the direction and the duration of moving. This includes a null move which consists in staying inert for some time, or forever. In a non-null move agents travel at the same constant speed, normalized to 1. We assume that agents have sensors enabling them to estimate the distance from the other agent (defined as the distance between centers of discs), but not the direction towards it. We consider two models of estimation. In both models an agent reads its sensor at the moment of its appearance in the plane and then at the end of each move. This reading (together with the previous ones) determines the decision concerning the next move. In both models the reading of the sensor tells the agent if the other agent is already present. Moreover, in the monotone model, each agent can find out, for any two readings in moments t1 and t2, whether the distance from the other agent at time t1 was smaller, equal or larger than at time t2. In the weaker binary model, each agent can find out, at any reading, whether it is at distance less than \r{ho} or at distance at least \r{ho} from the other agent, for some real \r{ho} > 1 unknown to them. Such distance estimation mechanism can be implemented, e.g., using chemical sensors. Each agent emits some chemical substance (scent), and the sensor of the other agent detects it, i.e., sniffs. The intensity of the scent decreases with the distance.Comment: A preliminary version of this paper appeared in the Proc. 23rd International Colloquium on Structural Information and Communication Complexity (SIROCCO 2016), LNCS 998

Nonlinear interaction between two heralded single photons

Harnessing nonlinearities strong enough to allow two single photons to interact with one another is not only a fascinating challenge but is central to numerous advanced applications in quantum information science. Currently, all known approaches are extremely challenging although a few have led to experimental realisations with attenuated classical laser light. This has included cross-phase modulation with weak classical light in atomic ensembles and optical fibres, converting incident laser light into a non-classical stream of photon or Rydberg blockades as well as all-optical switches with attenuated classical light in various atomic systems. Here we report the observation of a nonlinear parametric interaction between two true single photons. Single photons are initially generated by heralding one photon from each of two independent spontaneous parametric downconversion sources. The two heralded single photons are subsequently combined in a nonlinear waveguide where they are converted into a single photon with a higher energy. Our approach highlights the potential for quantum nonlinear optics with integrated devices, and as the photons are at telecom wavelengths, it is well adapted to applications in quantum communication.Comment: 4 pages, 4 figure

Unconventional charge order in a co-doped high-Tc superconductor

Charge-stripe order has recently been established as an important aspect of cuprate high-Tc superconductors. However, owing to the complex interplay between competing phases and the influence of disorder, it is unclear how it emerges from the parent high-temperature state. Here we report on the discovery of an unconventional ordered phase between charge-stripe order and (pseudogapped) metal in the cuprate La1.8xEu0.2SrxCuO4. We use three complementary experiments—nuclear quadrupole resonance, nonlinear conductivity and specific heat—to demonstrate that the order appears through a sharp phase transition and exists in a dome-shaped region of the phase diagram. Our results imply that the new phase is a state, which preserves translational symmetry: a charge nematic. We thus resolve the process of charge-stripe development in cuprates, show that this nematic phase is distinct from high-temperature pseudogap and establish a link with other strongly correlated electronic materials with prominent nematic order

From Euclidean Geometry to Knots and Nets

This document is the Accepted Manuscript of an article accepted for publication in Synthese. Under embargo until 19 September 2018. The final publication is available at Springer via https://doi.org/10.1007/s11229-017-1558-x.This paper assumes the success of arguments against the view that informal mathematical proofs secure rational conviction in virtue of their relations with corresponding formal derivations. This assumption entails a need for an alternative account of the logic of informal mathematical proofs. Following examination of case studies by Manders, De Toffoli and Giardino, Leitgeb, Feferman and others, this paper proposes a framework for analysing those informal proofs that appeal to the perception or modification of diagrams or to the inspection or imaginative manipulation of mental models of mathematical phenomena. Proofs relying on diagrams can be rigorous if (a) it is easy to draw a diagram that shares or otherwise indicates the structure of the mathematical object, (b) the information thus displayed is not metrical and (c) it is possible to put the inferences into systematic mathematical relation with other mathematical inferential practices. Proofs that appeal to mental models can be rigorous if the mental models can be externalised as diagrammatic practice that satisfies these three conditions.Peer reviewe

D-brane orbiting NS5-branes

We study real time dynamics of a Dp-brane orbiting a stack of NS5-branes. It is generally known that a BPS D-brane moving in the vicinity of NS5-branes becomes unstable due to the presence of tachyonic degree of freedom induced on the D-brane. Indeed, the D-brane necessarily falls into the fivebranes due to gravitational attraction and eventually collapses into a pressureless fluid. Such a decay of the D-brane is known to be closely related to the rolling tachyon problem. In this paper we show that in special cases the decay of D-brane caused by gravitational attraction can be avoided. Namely for certain values of energy and angular momentum the D-brane orbits around the fivebranes, maintaining certain distance from the fivebranes all the time, and the process of tachyon condensation is suppressed. We show that the tachyonic degree of freedom induced on such a D-brane really disappears and the brane returns to a stable D-brane.Comment: 12 pages, latex, added referenc

Gathering in Dynamic Rings

The gathering problem requires a set of mobile agents, arbitrarily positioned at different nodes of a network to group within finite time at the same location, not fixed in advanced. The extensive existing literature on this problem shares the same fundamental assumption: the topological structure does not change during the rendezvous or the gathering; this is true also for those investigations that consider faulty nodes. In other words, they only consider static graphs. In this paper we start the investigation of gathering in dynamic graphs, that is networks where the topology changes continuously and at unpredictable locations. We study the feasibility of gathering mobile agents, identical and without explicit communication capabilities, in a dynamic ring of anonymous nodes; the class of dynamics we consider is the classic 1-interval-connectivity. We focus on the impact that factors such as chirality (i.e., a common sense of orientation) and cross detection (i.e., the ability to detect, when traversing an edge, whether some agent is traversing it in the other direction), have on the solvability of the problem. We provide a complete characterization of the classes of initial configurations from which the gathering problem is solvable in presence and in absence of cross detection and of chirality. The feasibility results of the characterization are all constructive: we provide distributed algorithms that allow the agents to gather. In particular, the protocols for gathering with cross detection are time optimal. We also show that cross detection is a powerful computational element. We prove that, without chirality, knowledge of the ring size is strictly more powerful than knowledge of the number of agents; on the other hand, with chirality, knowledge of n can be substituted by knowledge of k, yielding the same classes of feasible initial configurations

Proper acceleration, geometric tachyon and dynamics of a fundamental string near Dpp branes

We present a detailed analysis of our recent observation that the origin of the geometric tachyon, which arises when a D$p$-brane propagates in the vicinity of a stack of coincident NS5-branes, is due to the proper acceleration generated by the background dilaton field. We show that when a fundamental string (F-string), described by the Nambu-Goto action, is moving in the background of a stack of coincident D$p$-branes, the geometric tachyon mode can also appear since the overall conformal mode of the induced metric for the string can act as a source for proper acceleration. We also studied the detailed dynamics of the F-string as well as the instability by mapping the Nambu-Goto action of the F-string to the tachyon effective action of the non-BPS D-string. We qualitatively argue that the condensation of the geometric tachyon is responsible for the (F,D$p$) bound state formation.Comment: 26 pages, v2: added references, v3: one ref. updated, to appear in Class. and Quant. Gravit

Effective descriptions of branes on non-geometric tori

We investigate the low-energy effective description of non-geometric compactifications constructed by T-dualizing two or three of the directions of a T^3 with non-vanishing H-flux. Our approach is to introduce a D3-brane in these geometries and to take an appropriate decoupling limit. In the case of two T-dualities, we find at low energies a non-commutative T^2 fibered non-trivially over an S^1. In the UV this theory is still decoupled from gravity, but is dual to a little string theory with flavor. For the case of three T-dualities, we do not find a sensible decoupling limit, casting doubt on this geometry as a low-energy effective notion in critical string theory. However, by studying a topological toy model in this background, we find a non-associative geometry similar to one found by Bouwknegt, Hannabuss, and Mathai.Comment: 22 pages, 4 figures, references adde